Nilpotents in finite symmetric inverse semigroups
نویسندگان
چکیده
منابع مشابه
Semigroup Closures of Finite Rank Symmetric Inverse Semigroups
We introduce the notion of semigroup with a tight ideal series and investigate their closures in semitopological semigroups, particularly inverse semigroups with continuous inversion. As a corollary we show that the symmetric inverse semigroup of finite transformations I n λ of the rank 6 n is algebraically closed in the class of (semi)topological inverse semigroups with continuous inversion. W...
متن کاملSchur–weyl Dualities for Symmetric Inverse Semigroups
We obtain Schur-Weyl dualities in which the algebras, acting on both sides, are semigroup algebras of various symmetric inverse semigroups and their deformations. AMS Subject Classification: 20M18; 16S99; 20M30; 05E10
متن کاملTwo generalisations of the symmetric inverse semigroups
We introduce two generalisations of the full symmetric inverse semigroup IX and its dual semigroup I ∗ X – inverse semigroups PI ∗ X and PI ∗ X . Both of them have the same carrier and contain IX . Binary operations on PI∗X and PI ∗ X are reminiscent of the multiplication in IX . We use a convenient geometric way to realise elements from these two semigroups. This enables us to study efficientl...
متن کاملFast Fourier Transforms for Finite Inverse Semigroups
We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its Fourier transform to the problems of computing Fourier transforms on its maximal subgroups and a fast zeta transform on its poset structure. We then exhibit exp...
متن کاملInverse semigroups with rational word problem are finite
This note proves a generalisation to inverse semigroups of Anisimov's theorem that a group has regular word problem if and only if it is finite, answering a question of Stuart Margolis. The notion of word problem used is the two-tape word problem – the set of all pairs of words over a generating set for the semigroup which both represent the same element.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society
سال: 1987
ISSN: 0013-0915,1464-3839
DOI: 10.1017/s0013091500026778